﻿#define _CRT_SECURE_NO_WARNINGS 1

#include "Sort.h"

// 测试排序的性能对⽐
void TestOP()
{
	//-------------------1.----------------------
	//1,这里代表着生成十万个数据，方便后序进行排序
	//a1、a2、a3分别指代不同的排序方法
	srand(time(0));
	const int N = 1000000;
	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	//int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);
	int* a5 = (int*)malloc(sizeof(int) * N);
	int* a6 = (int*)malloc(sizeof(int) * N);
	//int* a7 = (int*)malloc(sizeof(int) * N);
	int* a8 = (int*)malloc(sizeof(int) * N);
	for (int i = 0; i < N; ++i)
	{
		a1[i] = rand();
		//a2[i] = a1[i];
		//a3[i] = a1[i];
		a4[i] = a1[i];
		a5[i] = a1[i];
		a6[i] = a1[i];
		//a7[i] = a1[i];
		a8[i] = a1[i];
	}
	//-------------------1.----------------------
	//-------------------2.----------------------
	//2.clock是一个C语言中的函数，可以返回从程序开始运行到系现在所用的时间
	//用begin2 - begin1就可以得出算法运行的时间了
	/*int begin1 = clock();
	InsertSort(a1, N);
	int end1 = clock();*/

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	/*int begin3 = clock();
	SelectSort(a3, N);
	int end3 = clock();*/

	int begin4 = clock();
	HeapSort(a4, N);
	int end4 = clock();

	int begin5 = clock();
	QuickSortNoneD(a5, 0, N - 1);
	int end5 = clock();

	int begin6 = clock();
	MergeSort(a6, N);
	int end6 = clock();

	/*int begin7 = clock();
	BubbleSort(a7, N);
	int end7 = clock();*/

	int begin8 = clock();
	CountSort(a8, N);
	int end8 = clock();
	//-------------------2.----------------------
	//-------------------3.----------------------
	//3.最后将得出的时间进行打印并且销毁空间即可
	//printf("InsertSort:%d\n", end1 - begin1);
	printf("ShellSort:%d\n", end2 - begin2);
	//printf("SelectSort:%d\n", end3 - begin3);
	printf("HeapSort:%d\n", end4 - begin4);
	printf("QuickSort:%d\n", end5 - begin5);
	printf("MergeSort:%d\n", end6 - begin6);
	//printf("BubbleSort:%d\n", end7 - begin7);
	printf("CountSort:%d\n", end8 - begin8);
	free(a1);
	free(a2);
	//free(a3);
	free(a4);
	free(a5);
	free(a6);
	//free(a7);
	free(a8);
	//-------------------3.----------------------
}

void TestSort()
{
	int arr[] = { 2, 11, 10, 3, 5, 9, 7, 8, 1, 3, 12 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	//交换前
	printf("交换前：");
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");

	//检测函数
	CountSort(arr, sz);

	//交换后
	printf("交换后：");
	for (int i = 0; i < sz; i++)
	{
		printf("%d ", arr[i]);
	}
	printf("\n");
}

int main()
{
	//检验算法效率函数
	TestOP();

	//对排序算法正确性进行检测
	//TestSort();

	return 0;
}